Constructor Subtyping in the Calculus of Inductive Constructions
نویسندگان
چکیده
The Calculus of Inductive Constructions (CIC) is a powerful type system, featuring dependent types and inductive deenitions, that forms the basis of proof-assistant systems such as Coq and Lego. We extend CIC with constructor subtyping, a basic form of subtyping in which an inductive type is viewed as a subtype of another inductive type if has more elements than. It is shown that the calculus is well-behaved and provides a suitable basis for formalizing natural semantics in proof-development systems .
منابع مشابه
Constructor Subtyping
Constructor subtyping is a form of subtyping in which an induc tive type is viewed as a subtype of another inductive type if has more constructors than As suggested in its potential uses include proof assistants and functional programming languages In this paper we introduce and study the properties of a simply typed calculus with record types and datatypes and which supports record sub typing ...
متن کاملSubtyping-Based Type-Checking for System F with Induction and Coinduction
We present a type system with subtyping for a strongly normalizing, Curry-style language. Our type constructors include sum and product types, universal and existential quantifiers, inductive and coinductive types. Soundness and strong normalization are shown semantically by constructing a realizability model. We argue that the system is suitable for practical use based on our experience with a...
متن کاملTermination Checking with Types Strong Normalization for Mendler-Style Course-Of-Value Recursion
Giménez’ type system for structural recursion in the Calculus of Constructions is adapted to typed functional programming. As core language, the λ-calculus with inductive types, subtyping and bounded quantification is introduced. Decorated type variables, which represent approximations of inductive types, enable the type system to track the size of arguments to recursive functions and the size ...
متن کاملA Calculus of Constructions with Explicit Subtyping
The calculus of constructions can be extended with an infinite hierarchy of universes and cumulative subtyping. Subtyping is usually left implicit in the typing rules. We present an alternative version of the calculus of constructions where subtyping is explicit. We avoid problems related to coercions and dependent types by using the Tarski style of universes and by adding equations to reflect ...
متن کاملCoq à la Tarski: a predicative calculus of constructions with explicit subtyping
The predicative Calculus of Inductive Constructions (pCIC), the theory behind the Coq proof system, contains an infinite hierarchy of predicative universes T ype 0 ∈ T ype 1 ∈ T ype 2 ∈. .. and an impredicative universe P rop for propositions, together with an implicit cumulativity relation P rop ⊆ T ype 0 ⊆ T ype 1 ⊆ T ype 2 ⊆. .. . Subtyping in Coq is implicit, and is handled by the kernel. A...
متن کامل